Internet Congestion Control Subject to Node and Link Constraints

نویسندگان

  • Yongxiang Xia
  • David J. Hill
چکیده

Abstract: This paper studies the mathematical modelling of Internet congestion control. Differently to previous models, which consider either the link capacity or the node processing capability as the constraints, here we take both of them into account, i.e., the aggregate flow rate on a link cannot exceed the link capacity and the aggregate flow rate at a node is limited by the node processing capability. A decentralized primal-dual algorithm is proposed to solve the congestion control problem and its convergence is proven. Using this algorithm we show the bottleneck of the network performance when these two constraints are unbalanced.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Evaluating Multipath TCP Resilience against Link Failures

Standard TCP is the de facto reliable transfer protocol for the Internet. It is designed to establish a reliable connection using only a single network interface. However, standard TCP with single interfacing performs poorly due to intermittent node connectivity. This requires the re-establishment of connections as the IP addresses change. Multi-path TCP (MPTCP) has emerged to utilize multiple ...

متن کامل

An Adaptive Congestion Alleviating Protocol for Healthcare Applications in Wireless Body Sensor Networks: Learning Automata Approach

Wireless Body Sensor Networks (WBSNs) involve a convergence of biosensors, wireless communication and networks technologies. WBSN enables real-time healthcare services to users. Wireless sensors can be used to monitor patients’ physical conditions and transfer real time vital signs to the emergency center or individual doctors. Wireless networks are subject to more packet loss and congestion. T...

متن کامل

A Fuzzy Based Approach for Rate Control in Wireless Multimedia Sensor Networks

Wireless Multimedia Sensor Networks (WMSNs) undergo congestion when a link (or a node) becomes overpopulated in terms of incoming packets. In WMSNs this happens especially in upstream nodes where all incoming packets meet and directed to the sink node. Congestion in networks, if not handled properly, might lead to congestion collapse which deteriorates the quality of service (QoS). Therefore, i...

متن کامل

A Rate - Based Congestion Control Overlay System

A RATE-BASED CONGESTION CONTROL OVERLAY SYSTEM Lianjie Cao, M.S. George Mason University, 2011 Thesis Director: Dr. Brian L. Mark Traditional TCP/IP networks provide a best effort delivery service which places the complexity of congestion control in the end hosts, leaving the network relatively simple. It is well-known that the performance of the TCP congestion control scheme degrades severely ...

متن کامل

طراحی لایه- متقاطع برای کنترل ازدحام، مسیریابی و زمان‌بندی در شبکه‌های بی‌سیم ad-hocبا در نظر‌گرفتن توان الکتریکی گره‌ها

Abstract Ad hoc Wireless Networks, are networks formed by a collection of nodes through radio. In wireless networking environment, formidable challenges are presented. One important challenge is connection maintenance mechanism for power consumption. In this paper, a multi-objective optimal design is considered for ad-hoc networks which address the electrical power of nodes effects on cross-l...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008